On multiply-exponential write-once Turing machines
نویسندگان
چکیده
In this work we analyze the multiply-exponential complexity classes for writeonce Turing machines, i.e. machines that can write to a given tape cell at most once. We show that k–DExpWOSpace = k–DExpWOTime = k–ExpTime and the nondeterministic counterpart. For alternating machines we show that k–AExpWOTime = k–AExpTime = k-1–ExpSpace.
منابع مشابه
Turing Machines , P , NP and NP - completeness
I assume that most students have encountered Turing machines before. (Students who have not may want to look at Sipser’s book [3].) A Turing machine is defined by an integer k ≥ 1, a finite set of states Q, an alphabet Γ, and a transition function δ : Q×Γk → Q×Γk−1×{L, S,R}k where: • k is the number of (infinite, one-dimensional) tapes used by the machine. In the general case we have k ≥ 3 and ...
متن کاملNotes on Complexity Theory Notes Taken From
I assume that most students have encountered Turing machines before. (Students who have not may want to look at Sipser’s book [3].) A Turing machine is defined by an integer k ≥ 1, a finite set of states Q, an alphabet Γ, and a transition function δ : Q×Γk → Q×Γk−1×{L, S,R}k where: • k is the number of (infinite, one-dimensional) tapes used by the machine. In the general case we have k ≥ 3 and ...
متن کاملTuring Machines and Differential Linear Logic
We describe the vector space semantics for linear logic in which the exponential modality is modelled by cofree coalgebras. There is a natural differentiable structure in this semantics arising from the primitive elements. We provide an investigation of this structure, through many examples of proofs and their derivatives. In particular, an encoding of Turing machines in linear logic is given i...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملOn Nondeterminism versus Randomness for Read-Once Branching Programs
Randomized branching programs are a probabilistic model of computation defined in analogy to the well-known probabilistic Turing machines. In this paper, we present complexity theoretic results for randomized read-once branching programs. Our main result shows that nondeterminism can be more powerful than randomness for read-once branching programs. We present a function which is computable by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1407.7592 شماره
صفحات -
تاریخ انتشار 2014